Green Base Station Placement for Microwave Backhaul Links

Wireless mobile backhaul networks have been proposed as a substitute in cases in which wired alternatives are not available due to economical or geographical reasons. In this work, we study the location problem of base stations in a given region where mobile terminals are distributed according to a certain probability density function and the base stations communicate through microwave backhaul links. Using results of optimal transport theory, we provide the optimal asymptotic distribution of base stations in the considered setting by minimizing the total power over the whole network.Comment: Proceedings of the International Symposium on Ubiquitous Networking (UNet'17), May 2017, Casablanca, Morocc

Information Spreading on Almost Torus Networks

Epidemic modeling has been extensively used in the last years in the field of telecommunications and computer networks. We consider the popular Susceptible-Infected-Susceptible spreading model as the metric for information spreading. In this work, we analyze information spreading on a particular class of networks denoted almost torus networks and over the lattice which can be considered as the limit when the torus length goes to infinity. Almost torus networks consist on the torus network topology where some nodes or edges have been removed. We find explicit expressions for the characteristic polynomial of these graphs and tight lower bounds for its computation. These expressions allow us to estimate their spectral radius and thus how the information spreads on these networks

Defensive Resource Allocation in Social Networks

In this work, we are interested on the analysis of competing marketing campaigns between an incumbent who dominates the market and a challenger who wants to enter the market. We are interested in (a) the simultaneous decision of how many resources to allocate to their potential customers to advertise their products for both marketing campaigns, and (b) the optimal allocation on the situation in which the incumbent knows the entrance of the challenger and thus can predict its response. Applying results from game theory, we characterize these optimal strategic resource allocations for the voter model of social networks.Comment: arXiv admin note: text overlap with arXiv:1402.538

Eigen-Inference Moments Method for CognitiveWireless Communications

International audienceIn many situations, telecommunication engineers are faced with the problem of extracting information from the network. This corresponds in many cases to infer on functionals of spectrum of random matrices with only a limited knowledge on the statistics of the matrix entries. Here, the inference on the spectrum of random matrices is realized by moments method. In its full generality, the problem requires some sophisticated tools related to free probability theory and the explicit spectrum (complete information) can hardly be obtained (except for some trivial cases). Results in the asymptotic case and in the finite case are presented and simulations show how the moments method approach can be applied in practice. Several still open problems in this field are also presented

Capacité de Diffusion avec Codage Réseau dans les Grilles Toriques

International audienceDans ce travail, nous étudions les performances du codage réseau pour les réseaux sans fil multi-sauts dans le cas de la diffusion : une source transmet des informations (paquets) à tous les nœuds du réseau. La communication sans fil est modélisée comme un hyper-graphe, i.e. la même transmission d'un nœud atteint simultanément plusieurs de ses voisins. Nous analysons le cas particulier où les nœuds sont organisés dans une grille torique. Nous prouvons un résultat sur la capacité de diffusion du codage réseau sans-fil sur cette topologie, en utilisant des propriétés de la théorie des groupes. Une implication est que le codage réseau est ici "quasi optimal" en termes d'efficacité énergétique, dans le sens où une transmission apporte de nouvelles informations à "quasiment" chaque récepteur

Efficiency of Broadcast with Network Coding in Wireless Networks

We study network coding for multi-hop wireless networks. In particular, we consider the case of broadcasting: a source transmits information (packets) to all nodes in the network. Wireless communication is modeled as a hypergraph where the same transmission from one node achieves many of its neighbors and we analyze the case where the nodes are arranged on a torus grid. We provide the broadcast capacity of wireless network coding when all nodes have the same transmission rate, with the exception of the source. In order to do this we translate the min-cut problem on a hyper-graph in an equivalent problem of additive combinatorics and we use tools from group theory. In addition, in this case the network coding is ''near optimal'' in terms of energy efficiency.Dans ce document, nous étudions les performances du codage réseau appliqué à une forme spécifi que de multidi ffusion, la diffusion, où l'information (paquets) est envoyée d'une source à tous les nœuds d'un réseau multi-sauts sans fil. La communication sans fil est modélisée comme un hyper-graphe, i.e. la même transmission d'un nœud atteint simultanément plusieurs de ses voisins. Nous analysons le cas particulier où les nœuds sont organisés dans une grille torique. Nous étudions la capacité de di ffusion du codage réseau sans- fil sur cette topologie, en utilisant des outils de la géométrie discrète et de la théorie des groupes. Une implication est que le codage réseau est ici quasi optimal en termes d'efficacité énergétique, dans le sens où une transmission apporte de nouvelles informations à quasiment chaque récepteur

Advertising Competitions in Social Networks

In the present work, we study the advertising competition of several marketing campaigns who need to determine how many resources to allocate to potential customers to advertise their products through direct marketing while taking into account that competing marketing campaigns are trying to do the same. Potential customers rank marketing campaigns according to the offers, promotions or discounts made to them. Taking into account the intrinsic value of potential customers as well as the peer influence that they exert over other potential customers we consider the network value as a measure of their importance in the market and we find an analytical expression for it.We analyze the marketing campaigns competition from a game theory point of view, finding a closed form expression of the symmetric equilibrium offer strategy for the marketing campaigns from which no campaign has any incentive to deviate. We also present several scenarios, such as Winner-takes-all and Borda, but not the only possible ones for which our results allow us to retrieve in a simple way the corresponding equilibrium strategy

Information Spreading on Almost Torus Networks

International audienceEpidemic modeling has been extensively used in the last years in the field of telecommunications and computer networks. We consider the popular Susceptible-Infected-Susceptible spreading model as the metric for information spreading. In this work, we analyze information spreading on a particular class of networks denoted almost torus networks and over the lattice which can be considered as the limit when the torus length goes to infinity. Almost torus networks consist on the torus network topology where some nodes or edges have been removed. We find explicit expressions for the characteristic polynomial of these graphs and tight lower bounds for its computation. These expressions allow us to estimate their spectral radius and thus how the information spreads on these networks

An Integer Linear Programming Approach for Coalitional Weighted Manipulation under Scoring Rules

In this work, we are interested to prove that for voting systems which can be expressed as scoring rules, the coalitional weighted manipulation problem which is known to be NP-complete is as difficult as solving an integer linear programming problem. For this integer linear programming problem several software solutions exist, and we have found that with a reasonable number of candidates the solution can be found within seconds